Wellfoundedness proof with the maximal distinguished set
نویسندگان
چکیده
In Arai (An ordinal analysis of a single stable ordinal, submitted) it is shown that an $$\sup _{N<\omega }\psi _{\varOmega _{1}}(\varepsilon _{{\mathbb {S}}+N}+1})$$ upper bound for the proof-theoretic set theory $$\mathsf {KP}\ell ^{r}+(M\prec _{\Sigma _{1}}V)$$ . this paper we show second order arithmetic $$\Sigma ^{1-}_{2}{\mathrm {-CA}}+\Pi ^{1}_{1}{\mathrm {-CA}}_{0}$$ proves wellfoundedness up to $$\psi {S}}+N+1}})$$ each N. It easy interpret in
منابع مشابه
Proof Search with Set Variable
We show how a procedure developed by Bledsoe for automatically nding substitution instances for set variables in higher-order logic can be adapted to provide increased automation in proof search in the Calculus of Constructions (CC). Bledsoe's procedure operates on an extension of rst-order logic that allows existential quantiication over set variables. The method nds maximal solutions for this...
متن کاملOn the type of conjugacy classes and the set of indices of maximal subgroups
Let $G$ be a finite group. By $MT(G)=(m_1,cdots,m_k)$ we denote the type of conjugacy classes of maximal subgroups of $G$, which implies that $G$ has exactly $k$ conjugacy classes of maximal subgroups and $m_1,ldots,m_k$ are the numbers of conjugates of maximal subgroups of $G$, where $m_1leqcdotsleq m_k$. In this paper, we give some new characterizations of finite groups by ...
متن کاملProof-Set Search
Victor Allis’ proof-number search is a powerful best-first tree search method which can solve games by repeatedly expanding a most-proving node in the game tree. A well-known problem of proof-number search is that it does not account for the effect of transpositions. If the search builds a directed acyclic graph instead of a tree, the same node can be counted more than once, leading to incorrec...
متن کاملMaximal Domain for Strategy-Proof Rules with One Public Good
In the context of the provision of one pure public good, we study how large a preference domain can be to allow for the existence of strategy-proof rules satisfying the no vetoer condition. This question is qualified by the additional requirement that a domain should include ``a minimally rich domain.'' We first characterize generalized median voter schemes as the unique class of strategy-proof...
متن کاملCharacteristics of the maximal independent set ZDD
Zero-suppressed binary decision diagrams (ZDDs) are important data structures that are used in a number of combinatorial optimization settings. This paper explores a ZDD characterization for the maximal independent sets of a graph; a necessary and sufficient condition for when nodes in the ZDD can be merged is provided, and vertex orderings of the graph are studied to determine which orderings ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2022
ISSN: ['1432-0665', '0933-5846']
DOI: https://doi.org/10.1007/s00153-022-00840-8